A new double trust regions SQP method without a penalty function or a filter∗
نویسنده
چکیده
A new trust-region SQP method for equality constrained optimization is considered. This method avoids using a penalty function or a filter, and yet can be globally convergent to first-order critical points under some reasonable assumptions. Each SQP step is composed of a normal step and a tangential step for which different trust regions are applied in the spirit of Gould and Toint [Math. Program., 122 (2010), pp. 155-196]. Numerical results demonstrate that this new approach is potentially useful. Mathematical subject classification: 65K05, 90C30, 90C55.
منابع مشابه
A globally and superlinearly convergent trust-region SQP method without a penalty function for nonlinearly constrained optimization
In this paper, we propose a new trust-region SQP method, which uses no penalty function, for solving nonlinearly constrained optimization problem. Our method consists of alternate two algorithms. Specifically, we alternately proceed the feasibility restoration algorithm and the objective function minimization algorithm. The global and superlinear convergence property of the proposed method is s...
متن کاملNonlinear programming without a penalty function
Abstract. In this paper the solution of nonlinear programming problems by a Sequential Quadratic Programming (SQP) trust-region algorithm is considered. The aim of the present work is to promote global convergence without the need to use a penalty function. Instead, a new concept of a “filter” is introduced which allows a step to be accepted if it reduces either the objective function or the co...
متن کاملA Nonmonotone Filter Method for Minimax Problems
In this paper, we propose a modified trust-region filter method algorithm for Minimax problems, which based on the framework of SQP-filter method and associated with the technique of nonmonotone method. We use the SQP subproblem to acquire an attempt step, and use the filter to weigh the effect of the attempt step so as to avoid using penalty function. The algorithm uses the Lagrange function a...
متن کاملOn the superlinear local convergence of a filter-SQP method
Transition to superlinear local convergence is shown for a modified version of the trust-region filter-SQP method for nonlinear programming introduced by Fletcher, Leyffer, and Toint [8]. Hereby, the original trust-region SQP-steps can be used without an additional second order correction. The main modification consists in using the Lagrangian function value instead of the objective function va...
متن کاملNonlinear programming without a penalty function or a filter
A new method is introduced for solving equality constrained nonlinear optimization problems. This method does not use a penalty function, nor a barrier or a filter, and yet can be proved to be globally convergent to first-order stationary points. It uses different trustregions to cope with the nonlinearities of the objective function and the constraints, and allows inexact SQP steps that do not...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012